Traveling salesman games with the Monge property
نویسندگان
چکیده
منابع مشابه
Traveling salesman games with the Monge property
Several works have indicated the relationships between polynomially solvable combinatorial optimization problems and the core non-emptiness of cooperative games associated with them, and between intractable combinatorial optimization problems and the hardness of the problem to decide the core non-emptiness of the associated games. In this paper, we study the core of a traveling salesman game, w...
متن کاملMathematical Programming Manuscript No. Traveling Salesman Games with the Monge Property ?
Several works indicate the relationship between well-solved combinatorial optimization problems and the core non-emptiness of cooperative games associated with them. In this paper, we consider the core of symmetric traveling salesman games and relate it with well-solved cases of traveling salesman problems. We show that the core of a traveling salesman game in which the distance matrix is a sym...
متن کاملOn the Traveling Salesman Problem with a Relaxed Monge Matrix
We show that the traveling salesman problem with a symmetric relaxed Monge matrix as distance matrix is pyramidally solvable and can thus be solved by dynamic programming. Furthermore, we present a polynomial time algorithm that decides whether there exists a renumbering of the cities such that the resulting distance matrix becomes a relaxed Monge matrix.
متن کاملOn Traveling Salesman Games with Asymmetric Costs
We consider cooperative traveling salesman games with non-negative asymmetric costs satisfying the triangle inequality. We construct a stable cost allocation with budget balance guarantee equal to the Held-Karp integrality gap for the asymmetric traveling salesman problem, using the parsimonious property and a previously unknown connection to linear production games. We also show that our techn...
متن کاملCooperative assignment games with the inverse Monge property
We study inverse-Monge assignment games, namely cooperative assignment games in which the assignment matrix satisfies the inverse Monge property. For square inverse-Monge assignment games, we describe their cores and we obtain a closed formula for the buyers-optimal and the sellers-optimal core allocations. We also apply the above results to solve the non-square case.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/j.dam.2003.08.005